Adapting The Directed Grid Theorem into an FPT Algorithm
نویسندگان
چکیده
منابع مشابه
An FPT Algorithm for Directed Spanning k-Leaf
An out-branching of a directed graph is a rooted spanning tree with all arcs directed outwards from the root. We consider the problem of deciding whether a given digraph D has an out-branching with at least k leaves (Directed Spanning k-Leaf). We prove that this problem is fixed parameter tractable, when k is chosen as the parameter. Previously this was only known for restricted classes of dire...
متن کاملAn FPT Algorithm for Tree Deletion Set
We give a 5n time fixed-parameter algorithm for determining whether a given undirected graph on n vertices has a subset of at most k vertices whose deletion results in a tree. Such a subset is a restricted form of a feedback vertex set. While parameterized complexity of feedback vertex set problem and several of its variations have been well studied, to the best of our knowledge, this is the fi...
متن کاملAn FPT Algorithm for Set Splitting
An FPT algorithm with a running time of O(n+2n) is described for the Set Splitting problem, parameterized by the number k of sets to be split. It is also shown that there can be no FPT algorithm for this problem with a running time of the form 2n unless the satisfiability of n-variable 3SAT instances can be decided in time 2.
متن کاملDirected Feedback Vertex Set Problem is FPT
To decide if the parameterized feedback vertex set problem in directed graph is fixed-parameter tractable is a long time open problem. In this paper, we prove that the parameterized feedback vertex set in directed graph is fixed-parameter tractable and give the first FPT algorithm of running time O((1.48k)n) for it. As the feedback arc set problem in directed graph can be transformed to a feedb...
متن کاملAn FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes
Given a directed graph with n nodes, a root r, a setX of k nodes called terminals and non-negative weights ω over the arcs, the Directed Steiner Tree problem (DST) asks for a directed tree T ∗ of minimum cost ω(T ∗) rooted at r and spanning X. If this problem has several applications in multicast routing in packet switching networks, the modeling is no longer adapted in networks based upon the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2019
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2019.08.021